Visualizing Attack Trees with Circle Packing
ثبت نشده
چکیده
This paper explores the idea of visualizing attack trees by using circle packing; a tree visualization method which looks like a treemap but with circles. A proposal and proof of concept is presented to show how a basic attack tree can be visualized in this new way. And lastly, options to extend this visualization to support more kinds of different attack trees are explored.
منابع مشابه
Exploring Circle Packing Algorithms
We present an interactive tool for visualizing and experimenting with different circle packing algorithms. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems—Geometrical problems and computations.
متن کاملSupremum of a Process in Terms of Trees
In this paper we study the quantity E supt∈T Xt, where Xt is some random process. In the case of the Gaussian process, there is a natural sub-metric d defined on T . We find an upper bound in terms of labelled-covering trees of (T, d) and a lower bound in terms of packing trees (this uses the knowledge of packing numbers of subsets of T ). The two quantities are proved to be equivalent via a ge...
متن کاملA Sangaku Revived
Abstract In this paper we give an account on our mathematical and visual explorations inspired by a sangaku. First we introduce sangakus – traditional Japanese mathematical tablets. Then we give four examples of our static contemporary variants. Finally, we discuss in detail how a fifth sangaku led us to simulate the growth of water lilies, as a means of visualizing the problem. This approach l...
متن کاملCortical cartography using the discrete conformal approach of circle packings.
Cortical flattening algorithms are becoming more widely used to assist in visualizing the convoluted cortical gray matter sheet of the brain. Metric-based approaches are the most common but suffer from high distortions. Conformal, or angle-based algorithms, are supported by a comprehensive mathematical theory. The conformal approach that uses circle packings is versatile in the manipulation and...
متن کاملEgerváry Research Group on Combinatorial Optimization Packing Arborescences Packing Arborescences
In [7], Edmonds proved a fundamental theorem on packing arborescences that has become the base of several subsequent extensions. Recently, Japanese researchers found an unexpected further generalization which gave rise to many interesting questions about this subject [29], [20]. Another line of researches focused on covering intersecting families which generalizes Edmonds' theorems in a di eren...
متن کامل